0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.11/0.33 % Computer : n011.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1200 0.11/0.33 % WCLimit : 120 0.11/0.33 % DateTime : Tue Jul 13 14:22:25 EDT 2021 0.11/0.33 % CPUTime : 0.11/0.33 % Number of cores: 8 0.11/0.33 % Python version: Python 3.6.8 0.11/0.33 # Version: 2.6rc1-ho 0.18/0.34 # No SInE strategy applied 0.18/0.34 # Trying AutoSched0 for 59 seconds 0.18/0.46 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.18/0.46 # and selection function SelectMaxLComplexAvoidPosPred. 0.18/0.46 # 0.18/0.46 # Preprocessing time : 0.055 s 0.18/0.46 0.18/0.46 # Proof found! 0.18/0.46 # SZS status Theorem 0.18/0.46 # SZS output start CNFRefutation 0.18/0.46 thf(fact_15_siftDown_Osimps_I6_J, axiom, ![X21:a, X22:tree_a, X23:tree_a, X24:a, X25:tree_a, X26:tree_a, X27:a]:((((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X27=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))&(~(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X27)=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (t_a @ X24 @ X25 @ X26) @ (heapIm1091024090Down_a @ (t_a @ X27 @ (heapIm1140443833left_a @ (t_a @ X21 @ X22 @ X23)) @ (heapIm1257206334ight_a @ (t_a @ X21 @ X22 @ X23)))))))<=~(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X24 @ X25 @ X26))))&(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X24 @ X25 @ X26))=>((ord_less_eq_a @ (val_a @ (t_a @ X24 @ X25 @ X26)) @ X27=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))&(~(ord_less_eq_a @ (val_a @ (t_a @ X24 @ X25 @ X26)) @ X27)=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X24 @ X25 @ X26)) @ (heapIm1091024090Down_a @ (t_a @ X27 @ (heapIm1140443833left_a @ (t_a @ X24 @ X25 @ X26)) @ (heapIm1257206334ight_a @ (t_a @ X24 @ X25 @ X26)))) @ (t_a @ X21 @ X22 @ X23)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_15_siftDown_Osimps_I6_J)). 0.18/0.46 thf(fact_29_val_Osimps, axiom, ![X27:a, X28:tree_a, X29:tree_a]:(val_a @ (t_a @ X27 @ X28 @ X29))=(X27), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_29_val_Osimps)). 0.18/0.46 thf(fact_8_left_Osimps, axiom, ![X27:a, X103:tree_a, X104:tree_a]:(heapIm1140443833left_a @ (t_a @ X27 @ X103 @ X104))=(X103), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_left_Osimps)). 0.18/0.46 thf(fact_9_right_Osimps, axiom, ![X27:a, X194:tree_a, X104:tree_a]:(heapIm1257206334ight_a @ (t_a @ X27 @ X194 @ X104))=(X104), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_9_right_Osimps)). 0.18/0.46 thf(conj_0, conjecture, in_tree_a @ v @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.18/0.46 thf(fact_3__C5__1_Oprems_C, axiom, in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3__C5__1_Oprems_C)). 0.18/0.46 thf(fact_2_True, axiom, ord_less_eq_a @ v2 @ v1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2_True)). 0.18/0.46 thf(fact_5_in__tree_Osimps_I2_J, axiom, ![X27:a, X162:a, X163:tree_a, X104:tree_a]:(in_tree_a @ X27 @ (t_a @ X162 @ X163 @ X104)<=>((X27)=(X162)|in_tree_a @ X27 @ X104|in_tree_a @ X27 @ X163)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5_in__tree_Osimps_I2_J)). 0.18/0.46 thf(fact_7__C5__1_Ohyps_C_I1_J, axiom, (ord_less_eq_a @ (val_a @ (t_a @ v2 @ l2 @ r2)) @ (val_a @ (t_a @ v1 @ l1 @ r1))=>(~(ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v3)=>(in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))=>in_tree_a @ v @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_7__C5__1_Ohyps_C_I1_J)). 0.18/0.46 thf(fact_0_False, axiom, ~(((v)=(v2)|(v)=(v1)|(v)=(v3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_False)). 0.18/0.46 thf(c_0_10, plain, ![X21:a, X22:tree_a, X23:tree_a, X24:a, X25:tree_a, X26:tree_a, X27:a]:((~ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X24 @ X25 @ X26))=>((ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X27=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))&(~ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ X27=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (t_a @ X24 @ X25 @ X26) @ (heapIm1091024090Down_a @ (t_a @ X27 @ (heapIm1140443833left_a @ (t_a @ X21 @ X22 @ X23)) @ (heapIm1257206334ight_a @ (t_a @ X21 @ X22 @ X23))))))))&(ord_less_eq_a @ (val_a @ (t_a @ X21 @ X22 @ X23)) @ (val_a @ (t_a @ X24 @ X25 @ X26))=>((ord_less_eq_a @ (val_a @ (t_a @ X24 @ X25 @ X26)) @ X27=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))&(~ord_less_eq_a @ (val_a @ (t_a @ X24 @ X25 @ X26)) @ X27=>(heapIm1091024090Down_a @ (t_a @ X27 @ (t_a @ X24 @ X25 @ X26) @ (t_a @ X21 @ X22 @ X23)))=(t_a @ (val_a @ (t_a @ X24 @ X25 @ X26)) @ (heapIm1091024090Down_a @ (t_a @ X27 @ (heapIm1140443833left_a @ (t_a @ X24 @ X25 @ X26)) @ (heapIm1257206334ight_a @ (t_a @ X24 @ X25 @ X26)))) @ (t_a @ X21 @ X22 @ X23)))))), inference(fof_simplification,[status(thm)],[fact_15_siftDown_Osimps_I6_J])). 0.18/0.46 thf(c_0_11, plain, ![X868:a, X869:tree_a, X870:tree_a, X871:a, X872:tree_a, X873:tree_a, X874:a]:(((~ord_less_eq_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ X874|(heapIm1091024090Down_a @ (t_a @ X874 @ (t_a @ X871 @ X872 @ X873) @ (t_a @ X868 @ X869 @ X870)))=(t_a @ X874 @ (t_a @ X871 @ X872 @ X873) @ (t_a @ X868 @ X869 @ X870))|ord_less_eq_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ (val_a @ (t_a @ X871 @ X872 @ X873)))&(ord_less_eq_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ X874|(heapIm1091024090Down_a @ (t_a @ X874 @ (t_a @ X871 @ X872 @ X873) @ (t_a @ X868 @ X869 @ X870)))=(t_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ (t_a @ X871 @ X872 @ X873) @ (heapIm1091024090Down_a @ (t_a @ X874 @ (heapIm1140443833left_a @ (t_a @ X868 @ X869 @ X870)) @ (heapIm1257206334ight_a @ (t_a @ X868 @ X869 @ X870)))))|ord_less_eq_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ (val_a @ (t_a @ X871 @ X872 @ X873))))&((~ord_less_eq_a @ (val_a @ (t_a @ X871 @ X872 @ X873)) @ X874|(heapIm1091024090Down_a @ (t_a @ X874 @ (t_a @ X871 @ X872 @ X873) @ (t_a @ X868 @ X869 @ X870)))=(t_a @ X874 @ (t_a @ X871 @ X872 @ X873) @ (t_a @ X868 @ X869 @ X870))|~ord_less_eq_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ (val_a @ (t_a @ X871 @ X872 @ X873)))&(ord_less_eq_a @ (val_a @ (t_a @ X871 @ X872 @ X873)) @ X874|(heapIm1091024090Down_a @ (t_a @ X874 @ (t_a @ X871 @ X872 @ X873) @ (t_a @ X868 @ X869 @ X870)))=(t_a @ (val_a @ (t_a @ X871 @ X872 @ X873)) @ (heapIm1091024090Down_a @ (t_a @ X874 @ (heapIm1140443833left_a @ (t_a @ X871 @ X872 @ X873)) @ (heapIm1257206334ight_a @ (t_a @ X871 @ X872 @ X873)))) @ (t_a @ X868 @ X869 @ X870))|~ord_less_eq_a @ (val_a @ (t_a @ X868 @ X869 @ X870)) @ (val_a @ (t_a @ X871 @ X872 @ X873))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])). 0.18/0.46 thf(c_0_12, plain, ![X875:a, X876:tree_a, X877:tree_a]:(val_a @ (t_a @ X875 @ X876 @ X877))=(X875), inference(variable_rename,[status(thm)],[fact_29_val_Osimps])). 0.18/0.46 thf(c_0_13, plain, ![X982:a, X983:tree_a, X984:tree_a]:(heapIm1140443833left_a @ (t_a @ X982 @ X983 @ X984))=(X983), inference(variable_rename,[status(thm)],[fact_8_left_Osimps])). 0.18/0.46 thf(c_0_14, plain, ![X1150:a, X1151:tree_a, X1152:tree_a]:(heapIm1257206334ight_a @ (t_a @ X1150 @ X1151 @ X1152))=(X1152), inference(variable_rename,[status(thm)],[fact_9_right_Osimps])). 0.18/0.46 thf(c_0_15, plain, ![X1:tree_a, X3:a, X2:a, X5:tree_a, X7:tree_a, X6:a, X4:tree_a]:((heapIm1091024090Down_a @ (t_a @ X3 @ (t_a @ X2 @ X1 @ X4) @ (t_a @ X6 @ X5 @ X7)))=(t_a @ X3 @ (t_a @ X2 @ X1 @ X4) @ (t_a @ X6 @ X5 @ X7))|~ord_less_eq_a @ (val_a @ (t_a @ X2 @ X1 @ X4)) @ X3|~ord_less_eq_a @ (val_a @ (t_a @ X6 @ X5 @ X7)) @ (val_a @ (t_a @ X2 @ X1 @ X4))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.46 thf(c_0_16, plain, ![X1:tree_a, X4:tree_a, X2:a]:(val_a @ (t_a @ X2 @ X1 @ X4))=(X2), inference(split_conjunct,[status(thm)],[c_0_12])). 0.18/0.46 thf(c_0_17, negated_conjecture, ~in_tree_a @ v @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.18/0.46 thf(c_0_18, plain, ![X1:tree_a, X3:a, X2:a, X5:tree_a, X7:tree_a, X6:a, X4:tree_a]:(ord_less_eq_a @ (val_a @ (t_a @ X2 @ X1 @ X4)) @ X3|(heapIm1091024090Down_a @ (t_a @ X3 @ (t_a @ X2 @ X1 @ X4) @ (t_a @ X6 @ X5 @ X7)))=(t_a @ (val_a @ (t_a @ X2 @ X1 @ X4)) @ (heapIm1091024090Down_a @ (t_a @ X3 @ (heapIm1140443833left_a @ (t_a @ X2 @ X1 @ X4)) @ (heapIm1257206334ight_a @ (t_a @ X2 @ X1 @ X4)))) @ (t_a @ X6 @ X5 @ X7))|~ord_less_eq_a @ (val_a @ (t_a @ X6 @ X5 @ X7)) @ (val_a @ (t_a @ X2 @ X1 @ X4))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.46 thf(c_0_19, plain, ![X4:tree_a, X2:a, X1:tree_a]:(heapIm1140443833left_a @ (t_a @ X2 @ X1 @ X4))=(X1), inference(split_conjunct,[status(thm)],[c_0_13])). 0.18/0.46 thf(c_0_20, plain, ![X1:tree_a, X2:a, X4:tree_a]:(heapIm1257206334ight_a @ (t_a @ X2 @ X1 @ X4))=(X4), inference(split_conjunct,[status(thm)],[c_0_14])). 0.18/0.46 thf(c_0_21, plain, in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), inference(split_conjunct,[status(thm)],[fact_3__C5__1_Oprems_C])). 0.18/0.46 thf(c_0_22, plain, ![X1:tree_a, X2:a, X5:tree_a, X4:tree_a, X7:tree_a, X6:a, X3:a]:((heapIm1091024090Down_a @ (t_a @ X2 @ (t_a @ X3 @ X1 @ X4) @ (t_a @ X6 @ X5 @ X7)))=(t_a @ X2 @ (t_a @ X3 @ X1 @ X4) @ (t_a @ X6 @ X5 @ X7))|~ord_less_eq_a @ X3 @ X2|~ord_less_eq_a @ X6 @ X3), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16]), c_0_16]), c_0_16])). 0.18/0.46 thf(c_0_23, plain, ord_less_eq_a @ v2 @ v1, inference(split_conjunct,[status(thm)],[fact_2_True])). 0.18/0.46 thf(c_0_24, negated_conjecture, ~in_tree_a @ v @ (t_a @ v3 @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.18/0.46 thf(c_0_25, plain, ![X1095:a, X1096:a, X1097:tree_a, X1098:tree_a]:((~in_tree_a @ X1095 @ (t_a @ X1096 @ X1097 @ X1098)|((X1095)=(X1096)|in_tree_a @ X1095 @ X1098|in_tree_a @ X1095 @ X1097))&((((X1095)!=(X1096)|in_tree_a @ X1095 @ (t_a @ X1096 @ X1097 @ X1098))&(~in_tree_a @ X1095 @ X1098|in_tree_a @ X1095 @ (t_a @ X1096 @ X1097 @ X1098)))&(~in_tree_a @ X1095 @ X1097|in_tree_a @ X1095 @ (t_a @ X1096 @ X1097 @ X1098)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_5_in__tree_Osimps_I2_J])])])). 0.18/0.46 thf(c_0_26, plain, (ord_less_eq_a @ (val_a @ (t_a @ v2 @ l2 @ r2)) @ (val_a @ (t_a @ v1 @ l1 @ r1))=>(~ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v3=>(in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))=>in_tree_a @ v @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))))), inference(fof_simplification,[status(thm)],[fact_7__C5__1_Ohyps_C_I1_J])). 0.18/0.46 thf(c_0_27, plain, ![X1:tree_a, X2:a, X5:tree_a, X4:tree_a, X7:tree_a, X6:a, X3:a]:((heapIm1091024090Down_a @ (t_a @ X2 @ (t_a @ X3 @ X1 @ X4) @ (t_a @ X6 @ X5 @ X7)))=(t_a @ X3 @ (heapIm1091024090Down_a @ (t_a @ X2 @ X1 @ X4)) @ (t_a @ X6 @ X5 @ X7))|ord_less_eq_a @ X3 @ X2|~ord_less_eq_a @ X6 @ X3), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_16]), c_0_19]), c_0_20]), c_0_16]), c_0_16]), c_0_16])). 0.18/0.46 thf(c_0_28, plain, ~ord_less_eq_a @ v1 @ v3, inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])]), c_0_24])). 0.18/0.46 thf(c_0_29, plain, (((v)!=(v2)&(v)!=(v1))&(v)!=(v3)), inference(fof_nnf,[status(thm)],[fact_0_False])). 0.18/0.46 thf(c_0_30, plain, ![X4:tree_a, X3:a, X2:a, X1:tree_a]:(in_tree_a @ X2 @ (t_a @ X3 @ X4 @ X1)|~in_tree_a @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_25])). 0.18/0.46 thf(c_0_31, plain, (~ord_less_eq_a @ (val_a @ (t_a @ v2 @ l2 @ r2)) @ (val_a @ (t_a @ v1 @ l1 @ r1))|(ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v3|(~in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))|in_tree_a @ v @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))))), inference(fof_nnf,[status(thm)],[c_0_26])). 0.18/0.46 thf(c_0_32, plain, ![X1:tree_a, X3:a, X2:a, X4:tree_a]:((X2)=(X3)|in_tree_a @ X2 @ X4|in_tree_a @ X2 @ X1|~in_tree_a @ X2 @ (t_a @ X3 @ X1 @ X4)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.18/0.46 thf(c_0_33, plain, in_tree_a @ v @ (t_a @ v1 @ (heapIm1091024090Down_a @ (t_a @ v3 @ l1 @ r1)) @ (t_a @ v2 @ l2 @ r2)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_27]), c_0_23])]), c_0_28])). 0.18/0.46 thf(c_0_34, plain, (v)!=(v1), inference(split_conjunct,[status(thm)],[c_0_29])). 0.18/0.46 thf(c_0_35, negated_conjecture, ~in_tree_a @ v @ (t_a @ v2 @ l2 @ r2), inference(spm,[status(thm)],[c_0_24, c_0_30])). 0.18/0.46 thf(c_0_36, plain, ![X4:tree_a, X3:a, X2:a, X1:tree_a]:(in_tree_a @ X2 @ (t_a @ X3 @ X1 @ X4)|~in_tree_a @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_25])). 0.18/0.46 thf(c_0_37, plain, (ord_less_eq_a @ (val_a @ (t_a @ v1 @ l1 @ r1)) @ v3|in_tree_a @ v @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1)))|~ord_less_eq_a @ (val_a @ (t_a @ v2 @ l2 @ r2)) @ (val_a @ (t_a @ v1 @ l1 @ r1))|~in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ (heapIm1140443833left_a @ (t_a @ v1 @ l1 @ r1)) @ (heapIm1257206334ight_a @ (t_a @ v1 @ l1 @ r1))))), inference(split_conjunct,[status(thm)],[c_0_31])). 0.18/0.46 thf(c_0_38, plain, in_tree_a @ v @ (heapIm1091024090Down_a @ (t_a @ v3 @ l1 @ r1)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34]), c_0_35])). 0.18/0.46 thf(c_0_39, negated_conjecture, ~in_tree_a @ v @ (t_a @ v1 @ l1 @ r1), inference(spm,[status(thm)],[c_0_24, c_0_36])). 0.18/0.46 thf(c_0_40, plain, in_tree_a @ v @ (t_a @ v3 @ l1 @ r1), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_19]), c_0_19]), c_0_20]), c_0_16]), c_0_20]), c_0_38]), c_0_16]), c_0_16]), c_0_23])]), c_0_28])). 0.18/0.46 thf(c_0_41, plain, (v)!=(v3), inference(split_conjunct,[status(thm)],[c_0_29])). 0.18/0.46 thf(c_0_42, negated_conjecture, ~in_tree_a @ v @ l1, inference(spm,[status(thm)],[c_0_39, c_0_36])). 0.18/0.46 thf(c_0_43, negated_conjecture, ~in_tree_a @ v @ r1, inference(spm,[status(thm)],[c_0_39, c_0_30])). 0.18/0.46 thf(c_0_44, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_40]), c_0_41]), c_0_42]), c_0_43]), ['proof']). 0.18/0.46 # SZS output end CNFRefutation 0.18/0.46 # Proof object total steps : 45 0.18/0.46 # Proof object clause steps : 25 0.18/0.46 # Proof object formula steps : 20 0.18/0.46 # Proof object conjectures : 7 0.18/0.46 # Proof object clause conjectures : 5 0.18/0.46 # Proof object formula conjectures : 2 0.18/0.46 # Proof object initial clauses used : 14 0.18/0.46 # Proof object initial formulas used : 10 0.18/0.46 # Proof object generating inferences : 8 0.18/0.46 # Proof object simplifying inferences : 31 0.18/0.46 # Training examples: 0 positive, 0 negative 0.18/0.46 # Parsed axioms : 216 0.18/0.46 # Removed by relevancy pruning/SinE : 0 0.18/0.46 # Initial clauses : 490 0.18/0.46 # Removed in clause preprocessing : 82 0.18/0.46 # Initial clauses in saturation : 408 0.18/0.46 # Processed clauses : 533 0.18/0.46 # ...of these trivial : 8 0.18/0.46 # ...subsumed : 180 0.18/0.46 # ...remaining for further processing : 345 0.18/0.46 # Other redundant clauses eliminated : 49 0.18/0.46 # Clauses deleted for lack of memory : 0 0.18/0.46 # Backward-subsumed : 2 0.18/0.46 # Backward-rewritten : 4 0.18/0.46 # Generated clauses : 1642 0.18/0.46 # ...of the previous two non-trivial : 1355 0.18/0.46 # Contextual simplify-reflections : 5 0.18/0.46 # Paramodulations : 1387 0.18/0.46 # Factorizations : 4 0.18/0.46 # NegExts : 11 0.18/0.46 # Equation resolutions : 56 0.18/0.46 # Propositional unsat checks : 0 0.18/0.46 # Propositional check models : 0 0.18/0.46 # Propositional check unsatisfiable : 0 0.18/0.46 # Propositional clauses : 0 0.18/0.46 # Propositional clauses after purity: 0 0.18/0.46 # Propositional unsat core size : 0 0.18/0.46 # Propositional preprocessing time : 0.000 0.18/0.46 # Propositional encoding time : 0.000 0.18/0.46 # Propositional solver time : 0.000 0.18/0.46 # Success case prop preproc time : 0.000 0.18/0.46 # Success case prop encoding time : 0.000 0.18/0.46 # Success case prop solver time : 0.000 0.18/0.46 # Current number of processed clauses : 308 0.18/0.46 # Positive orientable unit clauses : 35 0.18/0.46 # Positive unorientable unit clauses: 0 0.18/0.46 # Negative unit clauses : 18 0.18/0.46 # Non-unit-clauses : 255 0.18/0.46 # Current number of unprocessed clauses: 1228 0.18/0.46 # ...number of literals in the above : 5428 0.18/0.46 # Current number of archived formulas : 0 0.18/0.46 # Current number of archived clauses : 9 0.18/0.46 # Clause-clause subsumption calls (NU) : 11365 0.18/0.46 # Rec. Clause-clause subsumption calls : 6303 0.18/0.46 # Non-unit clause-clause subsumptions : 169 0.18/0.46 # Unit Clause-clause subsumption calls : 1414 0.18/0.46 # Rewrite failures with RHS unbound : 0 0.18/0.46 # BW rewrite match attempts : 25 0.18/0.46 # BW rewrite match successes : 4 0.18/0.46 # Condensation attempts : 0 0.18/0.46 # Condensation successes : 0 0.18/0.46 # Termbank termtop insertions : 59200 0.18/0.46 0.18/0.46 # ------------------------------------------------- 0.18/0.46 # User time : 0.113 s 0.18/0.46 # System time : 0.015 s 0.18/0.46 # Total time : 0.128 s 0.18/0.46 # Maximum resident set size: 2144 pages 0.18/0.46 EOF